Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
نویسندگان
چکیده
منابع مشابه
Pdmi Preprint — 21/2006 Automated Proofs of Upper Bounds for Np-hard Problems: Implementation Details
Recently, several programs for automated analysis of the running time of splitting algorithms were implemented. In this paper we provide the details of implementation of the program presented by Fedin and Kulikov and indicate several ways of its improvement. Supported in part by INTAS (grants 04-77-7173 and 05-109-5352), RFBR (grants 05-01-00932, 06-01-00502, and 06-01-00584), and RAS Program f...
متن کاملUpper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedily rearranges the search path to minimize the cost of future searches. They showed that GreedyFuture...
متن کاملAlgorithms for NP-hard Optimization Problems and Cluster Analysis
Algorithms for NP-hard Optimization Problems and Cluster Analysis by Nan Li The set cover problem, weighted set cover problem, minimum dominating set problem and minimum weighted dominating set problem are all classical NP-hard optimization problems of great importance in both theory and real applications. Since the exact algorithms, which require exhaustive exploration of exponentially many op...
متن کاملPathwidth is NP-Hard for Weighted Trees
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for particular subclasses of chordal graphs, and we deduce that the problem remains hard for weighted trees. We also discuss subclasses of chordal graphs for which the problem is polynomial.
متن کاملAdapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search
The UCT algorithm, which combines the UCB algorithm and Monte-Carlo Tree Search (MCTS), is currently the most widely used variant of MCTS. Recently, a number of investigations into applying other bandit algorithms to MCTS have produced interesting results. In this research, we will investigate the possibility of combining the improved UCB algorithm, proposed by Auer et al. [2], with MCTS. Howev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2005
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-004-1145-7